Image Sharing Method Using Somewhat Homomorphic Encryption and Random Grid

نویسنده

  • Hao-Kuan Tso
چکیده

In recent years, image sharing method has become a popular technique due to the characteristics of security and simplicity. However, pixel expansion and bad image contrast are two common disadvantages that must be improved. This paper proposes an image sharing method to improve the problems mentioned above. First, the homomorphic encryption is utilized to enhance the security of digital images. Then the algorithm of random grid is utilized to construct the non-expanded shares. Furthermore, performing XOR and modular operations can completely recover the original secret images. Experimental results show the effectiveness of the proposed method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Privacy-Friendly Forecasting for the Smart Grid Using Homomorphic Encryption and the Group Method of Data Handling

While the smart grid has the potential to have a positive impact on the sustainability and efficiency of the electricity market, it also poses some serious challenges with respect to the privacy of the consumer. One of the traditional use-cases of this privacy sensitive data is the usage for forecast prediction. In this paper we show how to compute the forecast prediction such that the supplier...

متن کامل

Multi-integer Somewhat Homomorphic Encryption Scheme with China Remainder Theorem

As an effective solution to protect the privacy of the data, homomorphic encryption has become a hot research topic. Existing homomorphic schemes are not truly practical due to their high computational complexity and huge key size. In 2013, Coron et al. proposed a batch homomorphic encryption scheme, i.e. a scheme that supports encrypting and homomorphically evaluating several plaintext bits as...

متن کامل

Image encryption based on chaotic tent map in time and frequency domains

The present paper is aimed at introducing a new algorithm for image encryption using chaotic tent maps and the desired key image. This algorithm consists of two parts, the first of which works in the frequency domain and the second, in the time domain. In the frequency domain, a desired key image is used, and a random number is generated, using the chaotic tent map, in order to change the phase...

متن کامل

Faster Homomorphic Function Evaluation Using Non-integral Base Encoding

In this paper we present an encoding method for xed-point numbers tailored for homomorphic function evaluation. The choice of the degree of the polynomial modulus used in all popular somewhat homomorphic encryption schemes is dominated by security considerations, while with the current encoding techniques the correctness requirement allows for much smaller values. We introduce a generic encodin...

متن کامل

A Homomorphic Method for Sharing Secret Images

In this paper, we present a new method for sharing images between two parties exploiting homomorphic property of public key cryptosystem. With our method, we show that it is possible to multiply two encrypted images, to decrypt the resulted image and after to extract and reconstruct one of the two original images if the second original image is available. Indeed, extraction and reconstruction o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014